Access problems

On queueing problems in random-access communications

The general problem of allocating the capacity of a communication channel to a population of geographically distributed terminals is considered. The main focus is on the queueing problems that arise in the analysis of random access resolution algorithms. The performance measures of interest are the channel efficiency and the mean response time. The nature of known solutions for various random a...

Regional Network Access and its Inherent Problems

Promise Problems and Access to Unambiguous Computation

Query complexity, or why is it dicult to separate NP A T coNP A from P A by random oracles A. 24 as a result of an exhaustive search, thus x 6 2 L; hence M is a robust machine accepting L. Now suppose x 2 L and the promise problem A dened above is used as the oracle. We show that x is accepted in polynomial time.

Two Problems in Multiple Access Quantum Communication

Two prior results on the use of quantum resources to increase classical information-transmission capacity are generalized from single-link to multiple-access scenarios. The first is the use of superdense coding over qudit channels. The second is the use of joint measurements over successive uses of the pure-loss Bosonic channel.

Crisis management during anaesthesia: vascular access problems.

BACKGROUND In confronting an evolving crisis, the anaesthetist should consider the vascular catheter as a potential cause, abandoning assumptions that the device has been satisfactorily placed and is functioning correctly. OBJECTIVES To examine the role of a previously described core algorithm "COVER ABCD-A SWIFT CHECK", supplemented by a specific sub-algorithm for vascular access problems, i...